Mobile Crowdsourcing Task Allocation with Differential-and-Distortion Geo-Obfuscation

نویسندگان

چکیده

In mobile crowdsourcing, organizers usually need participants’ precise locations for optimal task allocation, e.g., minimizing selected workers’ travel distance to locations. However, the exposure of users’ raises privacy concerns. this paper, we propose a location privacy-preserving allocation framework with geo-obfuscation protect during assignments. More specifically, make participants obfuscate their reported under guarantee two rigorous schemes, differential and distortion privacy, without involve any third-party trusted entity. order achieve differential-and-distortion geo-obfuscation, formulate mixed-integer non-linear programming problem minimize expected workers constraints privacy. Moreover, worker may be willing accept multiple tasks, organizer concerned utility objectives such as acceptance ratio in addition distance. Against background, also extend our solution multi-task multi-objective optimization cases. Evaluation results on both simulation real-world user mobility traces verify effectiveness framework. Particularly, outperforms Laplace obfuscation, state-of-the-art mechanism, by achieving up 47 percent shorter average data same level protection.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Location Privacy-Preserving Task Allocation for Mobile Crowdsensing with Differential Geo-Obfuscation

In traditional mobile crowdsensing applications, organizers need participants’ precise locations for optimal task allocation, e.g., minimizing selected workers’ travel distance to task locations. However, the exposure of their locations raises privacy concerns. Especially for those who are not eventually selected for any task, their location privacy is sacrificed in vain. Hence, in this paper, ...

متن کامل

Task Allocation Schemes for Crowdsourcing in Opportunistic Mobile Social Networks

With the explosive proliferation of mobile devices, mobile crowdsourcing has become a new paradigm involving a crowd of mobile users to collectively take largescale tasks required by requesters in mobile social networks (MSNs). In this paper, we work on new task allocation schemes for mobile crowdsourcing in Opportunistic Mobile Social Networks (OMSNs) which are formed opportunistically when pe...

متن کامل

Dynamic Task Allocation for Crowdsourcing Settings

We consider the problem of optimal budget allocation for crowdsourcing problems, allocating users to tasks to maximize our final confidence in the crowdsourced answers. Such an optimized worker assignment method allows us to “boost” the efficacy of any popular crowdsourcing estimation algorithm. We consider a mutual information interpretation of the crowdsourcing problem, which leads to a stoch...

متن کامل

Quality and Budget Aware Task Allocation for Spatial Crowdsourcing

A major research challenge for spatial crowdsourcing is to improve the expected quality of the results. However, existing research in this field mostly focuses on achieving this objective in volunteer-based spatial crowdsourcing. In this paper, we introduce the budget limitations into the above problem and consider realistic cases where workers are paid unequally based on their trustworthiness....

متن کامل

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous “information piece-workers”, have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofreading. Because these low-paid workers can be unreliable, nearly all crowdsource...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing

سال: 2021

ISSN: ['1941-0018', '1545-5971', '2160-9209']

DOI: https://doi.org/10.1109/tdsc.2019.2912886